Automatic Proofs of Asymptotic ABNORMALITY (and much more!) of Natural Statistics Defined on Catalan-Counted Combinatorial Families
نویسندگان
چکیده
Preliminary Sermon: Humans will be Humans; The Medium is the Message The famous Catalan numbers (see [Sl1]), count zillions of combinatorial families (see [St]) and many humans have fun trying to find ‘nice’ bijections between family A and family B. While this may be fun for a while, sooner or later this game gets old, especially since the real reason Catalan numbers are so ubiquitous is their simplicity, and that humans can only grasp simple things. Indeed, (see [Z]), the reason for the ubiquity of the sequence of Catalan numbers, {cn}, is that their generating function C(z) := ∞ ∑
منابع مشابه
Staircase tilings and k-Catalan structures
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible generalization of the Catalan numbers. We will present a new combinatorial object that is enumerated by the k-Catalan numbers, staircase tilings. We give a bijection between staircase tilings and k-good paths, and between k-good paths and k-ary trees. In addition, we enumerate k-ary paths according to D...
متن کاملTableau Cycling and Catalan Numbers
We develop two combinatorial proofs of the fact that certain Young tableaux are counted by the Catalan numbers. The setting is a larger class of tableaux where labels increase along rows without attention to whether labels increase down columns. We define a new operation called tableau cycling. It is used to duplicate the reflection argument attributed to André in the tableaux setting, and also...
متن کاملOn Shapiro’s Catalan Convolution
L. Shapiro found an elegant formula for the self-convolution of the even subscrtipted terms in the Catalan sequence. This paper provides a natural q-analog of Shapiro’s formula together with three proofs, one of which is purely combinatorial.
متن کاملA GARDEN OF k-CATALAN STRUCTURES
The aim in this paper is to collect in one place a list of currently known and new structures enumerated by the k-ary numbers. Some of the structures listed already exist in the folk-lore, especially those that are easy generalizations of known combinatorial structures enumerated by the Catalan numbers. We will provide outlines on how the proofs for the Catalan structures generalize, and give p...
متن کاملThe Generating Function of the Catalan Numbers and Lower Triangular Integer Matrices
In the paper, by the Faà di Bruno formula, several identities for the Bell polynomials of the second kind, and an inversion theorem, the authors simplify coefficients of two families of nonlinear ordinary differential equations for the generating function of the Catalan numbers and discover inverses of fifteen closely related lower triangular integer matrices. 1. Motivation The Catalan numbers ...
متن کامل